Interacting dimers on a Sierpinski gasket

نویسندگان

  • William A. Seitz
  • Douglas J. Klein
  • Gerald E. Hite
چکیده

The different manners of embedding subgraphs of many disjoint edges in a parent graph arise in several different chemical and physical contexts. The problem of enumeration, or more generally of weighted summation, of such embeddings seems quite difficult to treat quantitatively, at least for general extended graphs. The special extended parent graph treated here with the inclusion of interaction between dimers is that of a Sierpinski gasket with a fractal dimension of In 3/in2. The manners of solution should extend to other fractal graphs with low ‘ramification degree’.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lee-Yang zeros and the Ising model on the Sierpinski Gasket

We study the distribution of the complex temperature zeros for the partition function of the Ising model on a Sierpinski gasket using an exact recursive relation. Although the zeros arrange on a curve pinching the real axis at T = 0 in the thermodynamic limit, their density vanishes asymptotically along the curve approaching the origin. This phenomenon explains the coincidence of the low temper...

متن کامل

Localization in fractal spaces: Exact results on the Sierpinski gasket.

Localization due to space structure, rather than due to randomness, is investigated by studying the usual tight-binding model on the Sierpinski gasket. Some exact results are obtained from the decimation —renormalization-group method. It is surprising that there exist an infinite number of extended states on the Sierpinski gasket. This set of extended states forms a Cantor set. The rest of the ...

متن کامل

Acyclic Edge-coloring of Sierpinski-like Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by χ′a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined ...

متن کامل

New Sierpenski Curves in Complex Plane

The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simplest fractal shapes in existence. There are many different and easy ways to generate a Sierpinski triangle. In this paper we have presented a new algorithm for generating the sierpinski gasket using complex variables.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1988